Notes 10 : Asymptotic Sample Complexity 2 LEM 10

نویسنده

  • Sebastien Roch
چکیده

Ξ = {ΞX , . . .}, be a sequence of i.i.d. samples generated by a CFN model (T ,P). A sequence of estimators {T̂k}k≥0 of T , where T̂k is based on k samples, has asymptotic sample complexity (ASC) at confidence level δ (at most) k0 if for all k ≥ k0 the probability that T̂k = T is at least δ. Typically, the ASC is expressed as an asymptotic expression of structural parameters of the model such as the number of leaves n, the shortest branch length f , or the diameter of the tree.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

آموزش منیفلد با استفاده از تشکیل گراف منیفلدِ مبتنی بر بازنمایی تنک

In this paper, a sparse representation based manifold learning method is proposed. The construction of the graph manifold in high dimensional space is the most important step of the manifold learning methods that is divided into local and gobal groups. The proposed graph manifold extracts local and global features, simultanstly. After construction the sparse representation based graph manifold,...

متن کامل

Non-Asymptotic Analysis of Relational Learning with One Network

This theoretical paper is concerned with a rigorous non-asymptotic analysis of relational learning applied to a single network. Under suitable and intuitive conditions on features and clique dependencies over the network, we present the first probably approximately correct (PAC) bound for maximum likelihood estimation (MLE). To our best knowledge, this is the first sample complexity result of t...

متن کامل

Asymptotic Analysis of Binary Gas Mixture Separation by Nanometric Tubular Ceramic Membranes: Cocurrent and Countercurrent Flow Patterns

Analytical gas-permeation models for predicting the separation process across  membranes (exit compositions and area requirement) constitutes an important and necessary step in understanding the overall performance of  membrane modules. But, the exact (numerical) solution methods suffer from the complexity of the solution. Therefore, solutions of nonlinear ordinary differential equations th...

متن کامل

Asymptotic properties of the sample mean in adaptive sequential sampling with multiple selection criteria

‎We extend the method of adaptive two-stage sequential sampling to‎‎include designs where there is more than one criteria is used in‎‎deciding on the allocation of additional sampling effort‎. ‎These‎‎criteria‎, ‎or conditions‎, ‎can be a measure of the target‎‎population‎, ‎or a measure of some related population‎. ‎We develop‎‎Murthy estimator for the design that is unbiased estimators for‎‎t...

متن کامل

Graph classes with given 3-connected components: asymptotic counting and critical phenomena

Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph classes based on singularity analysis of generating functions. This generalizes previously studied cases such as planar graphs and series-parallel graphs. We provide a general theorem for the asymptotic number of graphs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012